Heuristic and metaheuristic methods for the multi?skill project scheduling problem with partial preemption

The multi-skill project scheduling problem (MSPSP) has been first addressed in the community for more than 15 years. This article deals with a new variant of this problem, MSPSP partial preemption, where only subset resources can be released during preemption periods. Like standard is NP-hard, because which we propose series heuristic algorithms to solve instances arising from an industrial application. First, present serial greedy algorithm, based on priority rules and flow resource allocation. To improve solutions then introduce binary tree search algorithm randomized adaptive procedure (GRASP). Finally, large neighborhood (LNS) integrating exact methods. best results terms solution quality execution time are obtained by combining GRASP LNS approach. Furthermore, proposed able find 56 216 instance set, shows approach even special cases considered problem.